Gaussian embedding for large-scale gene set analysis
نویسندگان
چکیده
منابع مشابه
Embedding methods for large-scale surface calculations
One of the goals in the development of large scale electronic structure methods is to perform calculations explicitly for a localised region of a system, while still taking into account the rest of the system outside of this region. An example of this in surface physics would be to embed an adsorbate and a few surface atoms into an extended substrate, hence considerably reducing computational c...
متن کاملVisualisation for large-scale Gaussian updates
In geostatistics (and also in other applications in science and engineering) we are now performing updates on Gaussian process models with thousands of components. These large-scale inferences involve computational challenges, because the updating equations cannot be solved as written, owing to the size and cost of the matrix operations. They also involve representational challenges, to account...
متن کاملApproximate Gaussian Mixtures for Large Scale Vocabularies
We introduce a clustering method that combines the flexibility of Gaussian mixtures with the scaling properties needed to construct visual vocabularies for image retrieval. It is a variant of expectationmaximization that can converge rapidly while dynamically estimating the number of components. We employ approximate nearest neighbor search to speed-up the E-step and exploit its iterative natur...
متن کاملLarge Scale Experiments Data Analysis for Estimation of Hydrodynamic Force Coefficients Part 1: Time Domain Analysis
This paper describes various time-domain methods useful for analyzing the experimental data obtained from a circular cylinder force in terms of both wave and current for estimation of the drag and inertia coefficients applicable to the Morison’s equation. An additional approach, weighted least squares method is also introduced. A set of data obtained from experiments on heavily roughened circul...
متن کاملEfficient large scale commute time embedding
Commute time embedding involves computing eigenfunctions of the graph Laplacian matrix. Spectral decomposition requires computational burden proportional to 3 ( ) O n , which may not be suitable for large scale dataset. This paper proposes computationally efficient commute time embedding by applying Nyström method to the normalized graph Laplacian. The performance of the proposed algorithms is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature Machine Intelligence
سال: 2020
ISSN: 2522-5839
DOI: 10.1038/s42256-020-0193-2